منابع مشابه
Diamonds on large cardinals
Acknowledgements I want to express my sincere gratitude to my supervisor Professor Jouko Väänänen for supporting me during all these years of getting acquainted with the intriguing field of set theory. I am also grateful to all other members of the Helsinki Logic Group for interesting discussions and guidance. Especially I wish to thank Do-cent Tapani Hyttinen who patiently has worked with all ...
متن کاملMaximum Constraint Satisfaction on Diamonds
In this paper we study the complexity of the (weighted) maximum constraint satisfaction problem (Max CSP) over an arbitrary finite domain. In this problem, one is given a collection of weighted constraints on overlapping sets of variables, and the goal is to find an assignment of values to the variables so as to maximize the total weight of satisfied constraints. Max Cut is a typical example of...
متن کاملIncreasing Diamonds
A class of diamond-shaped combinatorial structures is studied whose enumerating generating functions satisfy differential equations of the form f2 “ Gpfq, for some function G. In addition to their own interests and being natural extensions of increasing trees, the study of such DAG-structures was motivated by modelling executions of seriesparallel concurrent processes; they may also be used in ...
متن کاملMinimum Weighted Feedback Vertex Set on Diamonds
Given a vertex weighted graph G, a minimum Weighted Feedback Vertex Set (MWFVS) is a subset F ⊆ V of vertices of minimum weight such that each cycle in G contains at least one vertex in F . The MWFVS on general graph is known to be NP-hard. In this paper we introduce a new class of graphs, namely the diamond graphs, and give a linear time algorithm to solve MWFVS on it. We will discuss, moreove...
متن کاملLecture Notes on Diamonds and Total Correctness
The previous lectures gave us a good understanding of how to reason about [·] properties of programs. We saw how to decompose in logic properties of the form [α;β]P and [if(Q)α elseβ]P etc. That is all good and useful, but we need to remember that [α]P means that P holds after all runs of program α. Since while programs α are deterministic and, thus, have at most one run, the formula [α]P , in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1954
ISSN: 0028-0836,1476-4687
DOI: 10.1038/173738a0